Semantics of Probabilistic Programs: A Weak Limit Approach
نویسندگان
چکیده
For a simple probabilistic language we present a semantics based on linear operators on infinite dimensional Hilbert spaces. We show the equivalence of this semantics with a standard operational one and we discuss its relationship with the well-known denotational semantics introduced by Kozen. For probabilistic programs, it is typical to use Banach spaces and their norm topology to model the properties to be analysed (observables). We discuss the advantages in considering instead Hilbert spaces as denotational domains, and we present a weak limit construction of the semantics of probabilistic programs which is based on the inner product structure of this space, i.e. the duality between states and observables.
منابع مشابه
Probabilistic Analysis of Programs: A Weak Limit Approach
We present an approach to probabilistic analysis which is based on program semantics and exploits the mathematical properties of the semantical operators to ensure a form of optimality for the analysis. As in the algorithmic setting, where the analysis results are used the help the design of efficient algorithms, the purposes of our framework are to offer static analysis techniques usable for r...
متن کاملStratified , Weak Stratified , and Three - valued Semantics ∗
We investigate the relationship between three-valued Kripke/Kleene semantics and stratified semantics for stratifiable logic programs. We first show these are compatible, in the sense that if the three-valued semantics assigns a classical truth value, the stratified approach will assign the same value. Next, the familiar fixed point semantics for pure Horn clause programs gives both smallest an...
متن کاملProbabilistic Horn Clause Verification
Constrained Horn clauses have proven to be a natural intermediate language for logically characterizing program semantics and reasoning about program behavior. In this paper, we present probabilistically constrained Horn clauses (pchc), which incorporate probabilistic variables inside otherwise traditional constrained Horn clauses. pchc enable reasoning about probabilistic programs by encoding ...
متن کاملNew Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge about the dependency among the events in the program. In this paper, we extend the language of hybrid probabilistic programs by allowing disjunctive composition functions to be associated with heads of clauses and ch...
متن کاملAlgorithmic probabilistic game semantics - Playing games with automata
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin’s probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the...
متن کامل